CADICAL, LINGELING, PLINGELING, TREENGELING and YALSAT Entering the SAT Competition 2017

This paper serves as a first solver description for our new SAT solver CADICAL and documents the versions of our other solvers submitted to the SAT Competition 2017, which are LINGELING, its two parallel variants TREENGELING and PLINGELING, and our local search solver YALSAT. LINGELING,PLINGELING, TREENGELING,YALSAT Our focus in the SAT Competition 2016 was on our new SAT solver SPLATZ [1]. It tried to simplify the LINGELING design, and further implemented a first inprocessing [2] version of blocked clause decomposition for SAT sweeping to detect equivalences. In the same spirit, we focus on a new solver called CADICAL in the SAT Competition 2017. We submitted to the agile, main, and no-limit tracks of the SAT Competition 2017 the LINGELING version bbe, which except for some minor bug fixes in the code for picking random decisions is the same as the version entering the SAT Competition 2016 [1]. Its parallel extensions PLINGELING and TREENGELING submitted to the parallel track have the same version bbe accordingly. They were were marking the state-ofthe-art in the parallel track of the SAT Competition 2016 [3] and have not changed at all. The same applies to our local search solver YALSAT which also did not really change and was submitted as version 03s to the random track only.